On Generalized Transitive Matrices
نویسندگان
چکیده
Transitivity of generalized fuzzy matrices over a special type of semiring is considered. The semiring is called incline algebra which generalizes Boolean algebra, fuzzy algebra, and distributive lattice. This paper studies the transitive incline matrices in detail. The transitive closure of an incline matrix is studied, and the convergence for powers of transitive incline matrices is considered. Some properties of compositions of incline matrices are also given, and a new transitive incline matrix is constructed from given incline matrices. Finally, the issue of the canonical form of a transitive incline matrix is discussed. The results obtained here generalize the corresponding ones on fuzzy matrices and lattice matrices shown in the references.
منابع مشابه
Transitive Packing
This paper is intended to give a concise understanding of the facial structure of previously separately investigated polyhedra. It introduces the notion of transitive packing and the transitive packing polytope and gives cutting plane proofs for huge classes of valid inequalities of this polytope. We introduce generalized cycle, generalized clique, generalized antihole, generalized antiweb, gen...
متن کاملTransitive Packing: A Unifying Concept in Combinatorial Optimization
This paper attempts to provide a better understanding of the facial structure of polyhedra previously investigated separately. It introduces the notion of transitive packing and the transitive packing polytope. Polytopes that turn out to be special cases of the transitive packing polytope include the node packing, acyclic subdigraph, bipartite subgraph, planar subgraph, clique partitioning, par...
متن کاملThe Composition, Convergence and Transitivity of Powers and Adjoint of Generalized Fuzzy Matrices
Path algebras are additively idempotent semirings and generalize Boolean algebras, fuzzy algebras, distributive lattices and inclines. Thus the Boolean matrices, the fuzzy matrices, the lattice matrices and the incline matrices are prototypical examples of matrices over path algebras. In this paper, generalized fuzzy matrices are considered as matrices over path algebras. Compositions of genera...
متن کاملTopological structure on generalized approximation space related to n-arry relation
Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...
متن کاملFast algorithms for anti-distance matrices as a generalization of Boolean matrices
We show that Boolean matrix multiplication, computed as a sum of products of column vectors with row vectors, is essentially the same as Warshall’s algorithm for computing the transitive closure matrix of a graph from its adjacency matrix. Warshall’s algorithm can be generalized to Floyd’s algorithm for computing the distance matrix of a graph with weighted edges. We will generalize Boolean mat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Applied Mathematics
دوره 2011 شماره
صفحات -
تاریخ انتشار 2011